Termination w.r.t. Q proof of TRS/AProVELPAR

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

INT₂(s₁(x), s₁(y)) -> INT₂(x, y)
INT₂(s₁(x), s₁(y)) -> INTLIST₁(int₂(x, y))
INTLIST₁(cons₂(x, y)) -> INTLIST₁(y)
INT₂(0, s₁(y)) -> INT₂(s₁(0), s₁(y))

The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

INT₂(s₁(x), s₁(y)) -> INT₂(x, y)
INT₂(s₁(x), s₁(y)) -> INTLIST₁(int₂(x, y))
INTLIST₁(cons₂(x, y)) -> INTLIST₁(y)
INT₂(0, s₁(y)) -> INT₂(s₁(0), s₁(y))

The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

INTLIST₁(cons₂(x, y)) -> INTLIST₁(y)

The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

INTLIST₁(cons₂(x, y)) -> INTLIST₁(y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(INTLIST₁(x₁)) = x₁
POL(cons₂(x₁, x₂)) = 1 + x₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

INT₂(s₁(x), s₁(y)) -> INT₂(x, y)
INT₂(0, s₁(y)) -> INT₂(s₁(0), s₁(y))

The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

INT₂(s₁(x), s₁(y)) -> INT₂(x, y)

The remaining pairs can at least be oriented weakly.

INT₂(0, s₁(y)) -> INT₂(s₁(0), s₁(y))

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(INT₂(x₁, x₂)) = x₂
POL(s₁(x₁)) = 1 + x₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

INT₂(0, s₁(y)) -> INT₂(s₁(0), s₁(y))

The TRS R consists of the following rules:

intlist₁(nil) -> nil
int₂(s₁(x), 0) -> nil
int₂(x, x) -> cons₂(x, nil)
intlist₁(cons₂(x, y)) -> cons₂(s₁(x), intlist₁(y))
int₂(s₁(x), s₁(y)) -> intlist₁(int₂(x, y))
int₂(0, s₁(y)) -> cons₂(0, int₂(s₁(0), s₁(y)))
intlist₁(cons₂(x, nil)) -> cons₂(s₁(x), nil)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.